A String-based Model for Infinite Granularities
نویسنده
چکیده
In the last few years, the concept of time granularity has been defined by several researchers, and a glossary of time granularity concepts has been published. These definitions often view a time granularity as a (mostly infinite) sequence of time granules. Although this view is conceptually clean, it is extremely inefficient or even practically impossible to represent a time granularity in this manner. In this paper, we present a practical formalism for the finite representation of infinite granularities. The formalism is string-based, allows symbolic reasoning, and can be extended to multiple dimensions to accommodate, for example, space.
منابع مشابه
All in Strings: a Powerful String-based Automatic MT Evaluation Metric with Multiple Granularities
String-based metrics of automatic machine translation (MT) evaluation are widely applied in MT research. Meanwhile, some linguistic motivated metrics have been suggested to improve the string-based metrics in sentencelevel evaluation. In this work, we attempt to change their original calculation units (granularities) of string-based metrics to generate new features. We then propose a powerful s...
متن کاملCalendars, Time Granularities, and Automata
The notion of time granularity comes into play in a variety of problems involving time representation and management in database applications, including temporal database design, temporal data conversion, temporal database inter-operability, temporal constraint reasoning, data mining, and time management in workflow systems. According to a commonly accepted view, any time granularity can be vie...
متن کاملTowards Compact and Tractable Automaten-Based Representations of Time Granularities
Different approaches to time granularity have been proposed in the database literature to formalize the notion of calendar, based on algebraic, logical, and string-based formalisms. In this paper, we further develop an alternative approach based on automata, originally proposed in [4], which makes it possible to deal with infinite time granularities in an effective (and efficient) way. In parti...
متن کاملTime Granularities and Ultimately Periodic Automata
The relevance of the problem of managing periodic phenomena is widely recognized in the area of knowledge representation and reasoning. One of the most effective attempts at dealing with this problem has been the addition of a notion of time granularity to knowledge representation systems. Different formalizations of such a notion have been proposed in the literature, following algebraic, logic...
متن کاملRepresenting and Reasoning about Temporal Granularities
In this paper, we propose a new logical approach to represent and to reason about different time granularities. We identify a time granularity as an infinite sequence of time points properly labelled with proposition symbols marking the starting and ending points of the corresponding granules, and we symbolically model sets of granularities by means of linear time logic formulas. Some real-worl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003